Additive Variable Length Codes for the Integers
نویسنده
چکیده
This paper introduces a new family of variable length codes for the integers, initially based on the Goldbach conjecture that every even integer is the sum of two primes. For an even integer we decompose the value into its two constituent primes and encode the ordinal numbers of those primes with an Elias gamma code. The method is then elaborated to handle odd integers. The paper then develops a more general method of encoding any integer as the sum of two integers and developing suitable basis sets of integers. Although the codes which are generated by these methods are characterised by widely-varying and unpredictable lengths, they are over some ranges shorter than most other variable length codes.
منابع مشابه
An On - line Variable Length
We present a methodology of an on-line variable-length binary encoding of a set of integers. The basic principle of this methodology is to maintain the preex property amongst the codes assigned on-line to a set of integers growing dynamically. The preex property enables unique decoding of a string of elements from this set. To show the utility of this on-line variable length binary encoding, we...
متن کاملEnumeration and construction of additive cyclic codes over Galois rings
Let R = GR(p, l) be a Galois ring of characteristic p and cardinality pεl, where p and l are prime integers. First, we give a canonical form decomposition for additive cyclic codes over R. This decomposition is used to construct additive cyclic codes and count the number of such codes, respectively. Thenwe give the trace dual code for each additive cyclic code over R from its canonical form dec...
متن کاملCodes for the World Wide Web
We introduce a new family of simple, complete instantaneous codes for positive integers, called ζ codes, which are suitable for integers distributed as a power law with small exponent (smaller than 2). The main motivation for the introduction of ζ codes comes from web-graph compression: if nodes are numbered according to URL lexicographical order, gaps in successor lists are distributed accordi...
متن کاملMinimal Binary Abelian Codes of length $p^m q^n$
We consider binary abelian codes of length pq where p and q are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or bounds of these weights. We give examples showing that these bounds are attained in some cases.
متن کاملOn the Usefulness of Fibonacci Compression Codes
Recent publications advocate the use of various variable length codes for which each codeword consists of an integral number of bytes in compression applications using large alphabets. This paper shows that another tradeoff with similar properties can be obtained by Fibonacci codes. These are fixed codeword sets, using binary representations of integers based on Fibonacci numbers of order m ≥ 2...
متن کامل